Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems

نویسندگان

  • Tien-Nam Le
  • Daniel Lokshtanov
  • Saket Saurabh
  • Stéphan Thomassé
  • Meirav Zehavi
چکیده

We consider four well-studied NP-complete packing/covering problems on graphs: Feedback Vertex Set in Tournaments (FVST), Cluster Vertex Deletion (CVD), Triangle Packing in Tournaments (TPT) and Induced P3-Packing. For these four problems kernels with O(k) vertices have been known for a long time. In fact, such kernels can be obtained by interpreting these problems as finding either a packing of k pairwise disjoint sets of size 3 (3-Set Packing) or a hitting set of size at most k for a family of sets of size at most 3 (3-Hitting Set). In this paper, we give the first kernels for FVST, CVD, TPT and Induced P3-Packing with a subquadratic number of vertices. Specifically, we obtain the following results. • FVST admits a kernel with O(k 32 ) vertices. • CVD admits a kernel with O(k 5 3 ) vertices. • TPT admits a kernel with O(k 3 2 ) vertices. • Induced P3-Packing admits a kernel with O(k 5 3 ) vertices. Our results resolve an open problem from WorKer 2010 on the existence of kernels with O(k2− ) vertices for FVST and CVD. All of our results are based on novel uses of old and new “expansion lemmas”, and a weak form of crown decomposition where (i) almost all of the head is used by the solution (as opposed to all), (ii) almost none of the crown is used by the solution (as opposed to none), and (iii) if H is removed from G, then there is almost no interaction between the head and the rest (as opposed to no interaction at all). ∗École Normale Supérieure de Lyon, Lyon, France. [email protected] †University of Bergen, Bergen, Norway. [email protected] ‡University of Bergen, Bergen, Norway, and The Institute of Mathematical Sciences, HBNI, Chennai, India. [email protected] §École Normale Supérieure de Lyon, Lyon, France. [email protected] ¶University of Bergen, Bergen, Norway. [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak compositions and their applications to polynomial lower bounds for kernelization

We introduce a new form of composition called weak composition that allows us to obtain polynomial kernelization lower-bounds for several natural parameterized problems. Let d ≥ 2 be some constant and let L1, L2 ⊆ {0, 1}∗ × N be two parameterized problems where the unparameterized version of L1 is NP-hard. Assuming coNP 6⊆ NP/poly, our framework essentially states that composing t L1-instances ...

متن کامل

A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time

We investigate whether kernelization results can be obtained if we restrict kernelization algorithms to run in logarithmic space. This restriction for kernelization is motivated by the question of what results are attainable for preprocessing via simple and/or local reduction rules. We find kernelizations for d-hitting set(k), d-set packing(k), edge dominating set(k) and a number of hitting and...

متن کامل

Kernelization Algorithms for d-Hitting Set Problems

A kernelization algorithm for the 3-Hitting-Set problem is presented along with a general kernelization for d-Hitting-Set problems. For 3-Hitting-Set, a quadratic kernel is obtained by exploring properties of yes instances and employing what is known as crown reduction. Any 3-Hitting-Set instance is reduced into an equivalent instance that contains at most 5k + k elements (or vertices). This ke...

متن کامل

Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints

The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U . The goal is to find a subset of U of the smallest possible size that intersects every set in F . The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the interse...

متن کامل

The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment

We develop a novel framework, the implicit hitting set approach, for solving a class of combinatorial optimization problems. The explicit hitting set problem is as follows: given a set U and a family S of subsets of U , find a minimum-cardinality set that intersects (hits) every set in S. In the implicit hitting set problem (IHSP), the family of subsets S is not explicitly listed (its size is, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018